Numerical solution of fluid queueing models for communication networks
نویسندگان
چکیده
منابع مشابه
Queueing Networks via Fluid Limit Models
The subject of this paper is open multiclass queueing networks, which are common models of communication networks, and complex manufacturing systems such as wafer fabrication facilities. We provide sufficient conditions for the existence of bounds on long-run average moments of the queue lengths at the various stations, and we bound the rate of convergence of the mean queue length to its steady...
متن کاملFluid Queueing Networks
We introduce a new method to investigate stability of work-conserving policies in multiclass queueing networks. The method decomposes feasible trajectories and uses linear programming to test stability. We show that this linear program is a necessary and sufficient condition for the stability of all work-conserving policies for multiclass fluid queueing networks with two stations. Furthermore, ...
متن کاملStability of Open Multiclass Queueing Networks via Fluid Models
This paper surveys recent work on the stability of open multiclass queueing networks via fluid models. We recapitulate the stability result of Dai [8]. To facilitate study of the converse of the stability result, we distinguish between the notion of fluid limit and that of fluid solution. We define the stability region of a service discipline and the global stability region of a network. Exampl...
متن کاملStability and optimization of queueing networks and their fluid models
We describe some approaches to the synthesis of optimal policies for multiclass queueing network models based upon the close connection between stability of queueing networks and their associated fluid limit models. It is found that there is also a close connection between optimization of the network and optimal control of the far simpler fluid network model. This observation leads to a new cla...
متن کاملUsing fluid models to prove stability of adversarial queueing networks
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2021
ISSN: 1757-899X
DOI: 10.1088/1757-899x/1070/1/012063